Efficient authentication scheme based on near-ring root extraction problem
نویسندگان
چکیده
منابع مشابه
On an authentication scheme based on the Root Problem in the braid group
Lal and Chaturvedi proposed two authentication schemes based on the difficulty of the Root Problem in the braid group. We point out that the first scheme is not really as secure as the Root Problem, and describe an efficient way to crack it. The attack works for any group. 1. The first authentication scheme Lal and Chaturvedi propose in [2] two authentication schemes based on the difficulty of ...
متن کاملLapin: An Efficient Authentication Protocol Based on Ring-LPN
We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint whic...
متن کاملAn efficient RFID mutual authentication scheme based on ECC
Recently, Radio Frequency Identification (RFID) technique has been widely deployed in many applications, such as medical drugs management in hospitals and missing children searching in amusement parks. The applications basically can be classified into two types: non-public key cryptosystem (PKC)-based and PKC-based. However, many of them have been found to be flawed in the aspect of privacy pro...
متن کاملEfficient deniable authentication protocol based on generalized ElGamal signature scheme
An efficient and non-interactive deniable authentication protocol is presented to enable a receiver to identify the source of a given message, but not prove the identity of the sender to a third party. The proposed protocol is based on the generalized ElGamal signature scheme and is more efficient than the previous protocols. We show that if an adversary could forge signatures of this protocol,...
متن کاملAn Authentication Scheme Based on the Twisted Conjugacy Problem
The conjugacy search problem in a group G is the problem of recovering an x ∈ G from given g ∈ G and h = xgx. The alleged computational hardness of this problem in some groups was used in several recently suggested public key exchange protocols, including the one due to Anshel, Anshel, and Goldfeld, and the one due to Ko, Lee et al. Sibert, Dehornoy, and Girault used this problem in their authe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2017
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/263/4/042137